Posterior Constraint Selection for Nonnegative Linear Programming
نویسندگان
چکیده
منابع مشابه
Constraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems
where x is an n-dimensional column vector of variables; A is an m×n matrix [aij ] with m rows of transposed n-dimensional column vectors ai , ∀i = 1, . . . ,m; b is an m-dimensional column vector; c is an n-dimensional column vector; and 0 is a column vector of zeros of appropriate dimension according to context. Simplex pivoting algorithms and polynomial interior-point barrier-function methods...
متن کاملLinear Equation Solving for Constraint Logic Programming
Linear constraint solving in constraint logic programming requires in cremental checks of the satis ability of a system of equations and inequali ties Experience has shown that Gauss Jordan elimination and the simplex method are e cient enough to be of practical value in the implementation of CLP languages based on linear arithmetic constraints However these algorithms must be modi ed to accomm...
متن کاملSparse nonnegative solution of underdetermined linear equations by linear programming.
Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polyt...
متن کاملConstraint weighting as linear programming
In constraint-based phonology right now, constraint ranking is the dominant mode, and phonologists have achieved a wealth of results with such systems and about them. Phonological theories based in constraint weighting have received comparatively less attention. It would be a mistake to conclude from this neglect, though, that weighting is not a viable alternative to ranking. Weighting systems ...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2017
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2017.71002